class Solution {
public:
    int largestCombination(vector<int>& candidates)
    {
        vector<int> a(33, 0);
        for (auto e : candidates)
        {
            while (e)
            {
                a[__lg(e & -e)]++;
                e &= e - 1;
            }
        }
        return *max_element(a.begin(), a.end());
    }
};